The Real Field with the Rational Points of an Elliptic Curve

نویسندگان

  • AYHAN GÜNAYDIN
  • PHILIPP HIERONYMI
چکیده

We consider the expansion of the real field by a subgroup of a one-dimensional definable group satisfying a certain diophantine condition. The main example is the group of rational points of an elliptic curve over a number field. We prove a completeness result, followed by a quantifier elimination result. Moreover we show that open sets definable in that structure are semialgebraic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the elliptic curves of the form $ y^2=x^3-3px $

By the Mordell-Weil theorem‎, ‎the group of rational points on an elliptic curve over a number field is a finitely generated abelian group‎. ‎There is no known algorithm for finding the rank of this group‎. ‎This paper computes the rank of the family $ E_p:y^2=x^3-3px $ of elliptic curves‎, ‎where p is a prime‎.

متن کامل

On the Elliptic Curves of the Form $y^2 = x^3 − pqx$

‎By the Mordell‎- ‎Weil theorem‎, ‎the group of rational points on an elliptic curve over a number field is a finitely generated abelian group‎. ‎This paper studies the rank of the family Epq:y2=x3-pqx of elliptic curves‎, ‎where p and q are distinct primes‎. ‎We give infinite families of elliptic curves of the form y2=x3-pqx with rank two‎, ‎three and four‎, ‎assuming a conjecture of Schinzel ...

متن کامل

Complete characterization of the Mordell-Weil group of some families of elliptic curves

 The Mordell-Weil theorem states that the group of rational points‎ ‎on an elliptic curve over the rational numbers is a finitely‎ ‎generated abelian group‎. ‎In our previous paper, H‎. ‎Daghigh‎, ‎and S‎. ‎Didari‎, On the elliptic curves of the form $ y^2=x^3-3px$‎, ‎‎Bull‎. ‎Iranian Math‎. ‎Soc‎.‎‎ 40 (2014)‎, no‎. ‎5‎, ‎1119--1133‎.‎, ‎using Selmer groups‎, ‎we have shown that for a prime $p...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

On Silverman's conjecture for a family of elliptic curves

Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009